Recovering Link Data from the B-graph of an Alternating Diagram
نویسنده
چکیده
In this paper we study ways in which link data may be recovered from the B-graph G of an alternating link diagram D of link L. In particular we find explicitly the coefficients of the three-variable backet (Kauffman square bracket) of D in terms of the Tutte polynomial of G. We go on to show how both polynomials capture the twist number of alternating 2-bridge and 3-braid link diagrams. Finally, we discuss the open questions of recovering the signature of L (when L is a knot) or the first homology group of the double cover of S branched over L from G.
منابع مشابه
The Tait Flyping Conjecture
We announce a proof of the Tait flyping conjecture; the confirmation of this conjecture renders almost trivial the problem of deciding whether two given alternating link diagrams represent equivalent links. The proof of the conjecture also shows that alternating links have no "hidden" symmetries. In the nineteenth century, the celebrated physicist and knot tabulator P. G. Tait proposed the foll...
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملA Criterion for Almost Alternating Links to Be Non-splittable
The notion of almost alternating links was introduced by C. Adams et al ([1]). Here we give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. This solves a question asked in [1]. A partial solution for special almost alternating links has been obtained by M. Hirasawa ([4]). As its applications, Theorem 2.3 gives us a way to see if a given almost a...
متن کاملEssential Twisted Surfaces in Alternating Link Complements
Checkerboard surfaces in alternating link complements are used frequently to determine information about the link. However, when many crossings are added to a single twist region of a link diagram, the geometry of the link complement stabilizes (approaches a geometric limit), but a corresponding checkerboard surface increases in complexity with crossing number. In this paper, we generalize chec...
متن کاملA Graph-Theoretic Approach to a Partial Order of Knots and Links
We say that a link L1 is an s-major of a link L2 if any diagram of L1 can be transformed into a diagram of L2 by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knots and links with the crossing number less than or equal to six. The proofs are given by g...
متن کامل